An improved quadratic program for unweighted Euclidean 1-center location problem
نویسندگان
چکیده
منابع مشابه
Unweighted p-center problem on extended stars
An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph asks to find a subset of the vertices of of cardinality such that the maximum weighted distances from to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.
متن کاملThe Weighted Euclidean 1-Center Problem
The special case where wi = 1, i = 1, . . . , n, was proposed by J. Sylvester in 1857 and amounts to finding the smallest circle that contains all the given points. The general case was introduced by Francis [3]. The most efficient algorithm known to date for the unweighted case is an O(n logn) algorithm by Shamos and Hoey [lo].' This algorithm utilizes the data structure so-called "Farthest po...
متن کاملClassical Center Location Problem Under Uncertain Environment
This paper investigates the $p$-center location problem on a network in which vertex weights and distances between vertices are uncertain. The concepts of the $alpha$-$p$-center and the expected $p$-center are introduced. It is shown that the $alpha$-$p$-center and the expected $p$-center models can be transformed into corresponding deterministic models. Finally, linear time algorithms for find...
متن کاملunweighted p-center problem on extended stars
an extended star is a tree which has only one vertex with degree larger than two. the -center problem in a graph asks to find a subset of the vertices of of cardinality such that the maximum weighted distances from to all vertices is minimized. in this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.
متن کاملThe quadratic stochastic Euclidean bipartite matching problem
We propose a new approach for the study of the quadratic stochastic Euclidean bipartite matching problem between two sets of N points each, N 1. The points are supposed independently randomly generated on a domain Ω ⊂ Rd with a given distribution ρ(x) on Ω. In particular, we derive a general expression for the correlation function and for the average optimal cost of the optimal matching. A prev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of King Saud University - Engineering Sciences
سال: 2013
ISSN: 1018-3639
DOI: 10.1016/j.jksues.2012.04.003